Computing Partial Data Cubes ∗
نویسندگان
چکیده
The precomputation of the different views of a data cube is critical to improving the response time of data cube queries for On-Line Analytical Processing (OLAP). However, the user is often not interested in the set of all views of the data cube but only in a certain subset of views. In this paper, we study the problem of computing the partial data cube, i.e. a subset of selected views in the lattice. We consider the case of dense relations, using top-down cube construction methods like Pipesort. This paper presents, both, sequential and parallel methods for partial data cube construction as well as an experimental performance evaluation of our methods.
منابع مشابه
Computing Partial Data Cubes for Parallel Data Warehousing Applications
In this paper, we focus on an approach to On-Line Analytical Processing (OLAP) that is based on a database operator and data structure called the datacube. The datacube is a relational operator that is used to construct all possible views of a given data set. Efficient algorithms for computing the entire datacube – both sequentially and in parallel – have recently been proposed. However, due to...
متن کاملParallel Volume Computation of the Union of Many Cubes
We present an algorithm and implementation for computing volumes and areas of the union of many congruent axisaligned cubes. Its expected execution time is linear. It has been tested to 100M cubes. The ideas extend to any mass property of the union of any polyhedra, and to online computations as more inputs are added. The algorithm is mostly a series of map-reduce operations and so parallelizes...
متن کاملEfficient Evaluation of Sparse Data Cubes
Computing data cubes requires the aggregation of measures over arbitrary combinations of dimensions in a data set. Efficient data cube evaluation remains challenging because of the potentially very large sizes of input datasets (e.g., in the data warehousing context), the wellknown curse of dimensionality, and the complexity of queries that need to be supported. This paper proposes a new dynami...
متن کاملA characterization of planar partial cubes
Partial cubes have been extensively investigated as well as planar graphs. In this note we introduce an additional topological kind of condition to the Chepoi’s expansion procedure that characterizes planar partial cubes. As a consequence we obtain a characterization of some other planar subclasses of partial cubes.
متن کامل-graceful labelings of partial cubes
7 Partial cubes are graphs that allow isometric embeddings into hypercubes. -graceful labelings of partial cubes are introduced as a natural extension of graceful labelings of trees. It is shown that several classes of partial cubes are -graceful, for instance even 9 cycles, Fibonacci cubes, and (newly introduced) lexicographic subcubes. The Cartesian product of -graceful partial cubes is again...
متن کامل